package jianzhiOffer;
//剑指 Offer 55 - I. 二叉树的深度
public class Num51_I_maxDepth {
    public int maxDepth(TreeNode root) {
        if (root == null){
            return 0;
        }else {
            return 1+Math.max(maxDepth(root.left),maxDepth(root.right));
        }

    }

}
